Oriented equational clauses as a programming language
نویسندگان
چکیده
منابع مشابه
Oriented Equational Logic Programming is Complete
We show the completeness of an extension of SLDDresolution to the equational setting. This proves a conjecture of Laurent Fribourg and shows the completeness of an implementation of his. It is the rst completeness result for superposition of equational Horn clauses which reduces to SLD resolution in the nonnequational case. The inference system proved complete is actually more general than the ...
متن کاملCedalion A Language Oriented Programming Language
Implementations of language oriented programming (LOP) are typically either language workbenches, which facilitate the development of external domain speci c languages (DSLs) with projectional editors, or host languages for internal DSLs that are parsed. In this work, we present Cedalio a novel approach to LOP, along with a prototyped programming language and workbench implementing our approach...
متن کاملA Linguistics Oriented Programming Language
A programming language fo r natural language processing programs is descr ibed. Examples of the output of programs w r i t t e n using it are g iven. The reasons fo r various design decisions are discussed. An actual session wi th the system is presented, in which a small fragment of an Engl ish-to-French t r ans la to r is devel oped. Some of the l i m i t a t i o n s of the system are d i s c...
متن کاملLanguage-Oriented Programming
This paper describes the concept of language oriented programming which is a novel way of organising the development of a large software system, leading to a different structure for the finished product. The approach starts by developing a formally specified, domain-oriented, very high-level language which is designed to be well-suited to developing “this kind of program”. The development proce...
متن کاملOn the Complexity of Equational Horn Clauses
Security protocols employing cryptographic primitives with algebraic properties are conveniently modeled using Horn clauses modulo equational theories. We consider clauses corresponding to the class H3 of Nielson, Nielson and Seidl. We show that modulo the theory ACU of an associative-commutative symbol with unit, as well as its variants like the theory XOR and the theory AG of Abelian groups, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1984
ISSN: 0743-1066
DOI: 10.1016/0743-1066(84)90003-7